0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
0.12/0.34	% Computer   : n003.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 180
0.12/0.34	% DateTime   : Thu Aug 29 16:59:21 EDT 2019
0.19/0.34	% CPUTime    : 
150.87/150.82	% SZS status Theorem
150.87/150.82	% Mode: mode469
150.87/150.82	% Inferences: 22261
150.87/150.82	% SZS output start Proof
150.87/150.82	thf(ty_eigen__8, type, eigen__8 : $i).
150.87/150.82	thf(ty_g, type, g : ($i>$i)).
150.87/150.82	thf(h0, assumption, (![X1:$i>$o]:(![X2:$i]:((X1 @ X2) => (X1 @ (eps__0 @ X1))))),introduced(assumption,[])).
150.87/150.82	thf(eigendef_eigen__8, definition, eigen__8 = (eps__0 @ (^[X1:$i]:(~(((@+[X2:$i]:((g @ X1) = (g @ X2))) = X1))))), introduced(definition,[new_symbols(definition,[eigen__8])])).
150.87/150.82	thf(sP1,plain,sP1 <=> (![X1:$i]:(![X2:$i]:(((g @ X1) = (g @ X2)) => (X1 = X2)))),introduced(definition,[new_symbols(definition,[sP1])])).
150.87/150.82	thf(sP2,plain,sP2 <=> (![X1:$i]:(![X2:$i]:((X1 = X2) => (X2 = X1)))),introduced(definition,[new_symbols(definition,[sP2])])).
150.87/150.82	thf(sP3,plain,sP3 <=> (![X1:$i]:(((g @ eigen__8) = X1) => (X1 = (g @ eigen__8)))),introduced(definition,[new_symbols(definition,[sP3])])).
150.87/150.82	thf(sP4,plain,sP4 <=> (((g @ (@+[X1:$i]:((g @ eigen__8) = (g @ X1)))) = (g @ eigen__8)) => ((@+[X1:$i]:((g @ eigen__8) = (g @ X1))) = eigen__8)),introduced(definition,[new_symbols(definition,[sP4])])).
150.87/150.82	thf(sP5,plain,sP5 <=> (((g @ eigen__8) = (g @ (@+[X1:$i]:((g @ eigen__8) = (g @ X1))))) => ((g @ (@+[X1:$i]:((g @ eigen__8) = (g @ X1)))) = (g @ eigen__8))),introduced(definition,[new_symbols(definition,[sP5])])).
150.87/150.82	thf(sP6,plain,sP6 <=> ((@+[X1:$i]:((g @ eigen__8) = (g @ X1))) = eigen__8),introduced(definition,[new_symbols(definition,[sP6])])).
150.87/150.82	thf(sP7,plain,sP7 <=> (eigen__8 = eigen__8),introduced(definition,[new_symbols(definition,[sP7])])).
150.87/150.82	thf(sP8,plain,sP8 <=> (![X1:$i]:(~(((g @ eigen__8) = (g @ X1))))),introduced(definition,[new_symbols(definition,[sP8])])).
150.87/150.82	thf(sP9,plain,sP9 <=> ((g @ eigen__8) = (g @ (@+[X1:$i]:((g @ eigen__8) = (g @ X1))))),introduced(definition,[new_symbols(definition,[sP9])])).
150.87/150.82	thf(sP10,plain,sP10 <=> (![X1:$i]:(((g @ (@+[X2:$i]:((g @ eigen__8) = (g @ X2)))) = (g @ X1)) => ((@+[X2:$i]:((g @ eigen__8) = (g @ X2))) = X1))),introduced(definition,[new_symbols(definition,[sP10])])).
150.87/150.82	thf(sP11,plain,sP11 <=> ((^[X1:$i]:(@+[X2:$i]:((g @ X1) = (g @ X2)))) = (^[X1:$i]:X1)),introduced(definition,[new_symbols(definition,[sP11])])).
150.87/150.82	thf(sP12,plain,sP12 <=> ((g @ (@+[X1:$i]:((g @ eigen__8) = (g @ X1)))) = (g @ eigen__8)),introduced(definition,[new_symbols(definition,[sP12])])).
150.87/150.82	thf(sP13,plain,sP13 <=> (![X1:$i>$i]:(~(((^[X2:$i]:(X1 @ (g @ X2))) = (^[X2:$i]:X2))))),introduced(definition,[new_symbols(definition,[sP13])])).
150.87/150.82	thf(sP14,plain,sP14 <=> (sP1 => (~(sP13))),introduced(definition,[new_symbols(definition,[sP14])])).
150.87/150.82	thf(sP15,plain,sP15 <=> (![X1:$i]:((@+[X2:$i]:((g @ X1) = (g @ X2))) = X1)),introduced(definition,[new_symbols(definition,[sP15])])).
150.87/150.82	thf(sP16,plain,sP16 <=> ((g @ eigen__8) = (g @ eigen__8)),introduced(definition,[new_symbols(definition,[sP16])])).
150.87/150.82	thf(cTHM591_pme,conjecture,sP14).
150.87/150.82	thf(h1,negated_conjecture,(~(sP14)),inference(assume_negation,[status(cth)],[cTHM591_pme])).
150.87/150.82	thf(1,plain,((~(sP4) | ~(sP12)) | sP6),inference(prop_rule,[status(thm)],[])).
150.87/150.82	thf(2,plain,(~(sP10) | sP4),inference(all_rule,[status(thm)],[])).
150.87/150.82	thf(3,plain,sP7,inference(prop_rule,[status(thm)],[])).
150.87/150.82	thf(4,plain,(sP16 | ~(sP7)),inference(prop_rule,[status(thm)],[])).
150.87/150.82	thf(5,plain,(~(sP8) | ~(sP16)),inference(all_rule,[status(thm)],[])).
150.87/150.82	thf(6,plain,((~(sP5) | ~(sP9)) | sP12),inference(prop_rule,[status(thm)],[])).
150.87/150.82	thf(7,plain,(~(sP3) | sP5),inference(all_rule,[status(thm)],[])).
150.87/150.82	thf(8,plain,(~(sP2) | sP3),inference(all_rule,[status(thm)],[])).
150.87/150.82	thf(9,plain,(sP9 | sP8),inference(choice_rule,[status(thm)],[])).
150.87/150.82	thf(10,plain,(~(sP1) | sP10),inference(all_rule,[status(thm)],[])).
150.87/150.82	thf(11,plain,(sP15 | ~(sP6)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__8])).
150.87/150.82	thf(12,plain,(sP11 | ~(sP15)),inference(prop_rule,[status(thm)],[])).
150.87/150.82	thf(13,plain,sP2,inference(@eq_sym,[status(thm)],[])).
150.87/150.82	thf(14,plain,(~(sP13) | ~(sP11)),inference(all_rule,[status(thm)],[])).
150.87/150.82	thf(15,plain,(sP14 | sP13),inference(prop_rule,[status(thm)],[])).
150.87/150.82	thf(16,plain,(sP14 | sP1),inference(prop_rule,[status(thm)],[])).
150.87/150.82	thf(17,plain,$false,inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,h1])).
150.87/150.82	thf(18,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[17,h0])).
150.87/150.82	thf(0,theorem,sP14,inference(contra,[status(thm),contra(discharge,[h1])],[17,h1])).
150.87/150.82	% SZS output end Proof
150.87/150.82	EOF